Ampersand - Applying Relation Algebra in Practice
نویسندگان
چکیده
Relation algebra can be used to specify information systems and business processes. It was used in practice in two large IT projects in the Dutch government. But which are the features that make relation algebra practical? This paper discusses these features and motivates them from an information system designer’s point of view. The resulting language, Ampersand , is a syntactically sugared version of relation algebra. It is a typed language, which is supported by a compiler. The design approach, also called Ampersand, uses software tools that compile Ampersand scripts into functional specifications. This makes Ampersand interesting as an application of relation algebra in the industrial practice. The purpose of this paper is to define Ampersand and motivate its features from a practical perspective. This work is part of the research programme of the Information Systems & Business Processes (IS&BP) department of the Open University.
منابع مشابه
Quotient BCI-algebras induced by pseudo-valuations
In this paper, we study pseudo-valuations on a BCI-algebra and obtain some related results. The relation between pseudo-valuations and ideals is investigated. We use a pseudo-metric induced by a pseudovaluation to introduce a congruence relation on a BCI-algebra. We define the quotient algebra induced by this relation and prove that it is also a BCI-algebra and study its properties.
متن کاملSome notes on L-projections on Fourier-Stieltjes algebras
In this paper, we investigate the relation between L-projections and conditional expectations on subalgebras of the Fourier Stieltjes algebra B(G), and we will show that compactness of G plays an important role in this relation.
متن کاملApplying relation algebra and RelView to measures in a social network
We present an application of relation algebra to measure agents’ ‘strength’ in a social network with influence between agents. In particular, we deal with power, success, and influence of an agent as measured by the generalized Hoede-Bakker index and its modifications, and by the influence indices. We also apply relation algebra to determine followers of a coalition and the kernel of an influen...
متن کاملPURRS: Towards Computer Algebra Support for Fully Automatic Worst-Case Complexity Analysis
Fully automatic worst-case complexity analysis has a number of applications in computer-assisted program manipulation. A classical and powerful approach to complexity analysis consists in formally deriving , from the program syntax, a set of constraints expressing bounds on the resources required by the program, which are then solved, possibly applying safe approximations. In several interestin...
متن کاملExtended Fuzzy $BCK$-subalgebras
This paper extends the notion of fuzzy $BCK$-subalgebras to fuzzy hyper $BCK$-subalgebras and defines an extended fuzzy $BCK$-subalgebras. This study considers a type of fuzzy hyper $BCK$-ideals in this hyperstructure and describes the relationship between hyper $BCK$-ideals and fuzzy hyper $BCK$-ideals. In fact, it tries to introduce a strongly regular relation on hyper $...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011